Combinatorics of the change-making problem

نویسندگان

  • Anna Adamaszek
  • Michal Adamaszek
چکیده

We investigate the structure of the currencies (systems of coins) for which the greedy change-making algorithm always finds an optimal solution (that is, a one with minimum number of coins). We present a series of necessary conditions that must be satisfied by the values of coins in such systems. We also uncover some relations between such currencies and their sub-currencies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sensitivity Analysis of Simple Additive Weighting Method (SAW): The Results of Change in the Weight of One Attribute on the Final Ranking of Alternatives

Most of data in a multi-attribute decision making (MADM) problem are unstable and changeable, then sensitivity analysis after problem solving can effectively contribute to making accurate decisions. This paper provides a new method for sensitivity analysis of MADM problems so that by using it and changing the weights of attributes, one can determine changes in the final results of a decision ma...

متن کامل

Sensitivity Analysis of TOPSIS Technique: The Results of Change in the Weight of One Attribute on the Final Ranking of Alternatives

Most of data in Multi-attribute decision making (MADM) problems are changeable rather than constant and stable. Therefore, sensitivity analysis after problem solving can effectively contribute to making accurate decisions. In this paper, we offer a new method for sensitivity analysis in multi-attribute decision making problems in which if the weights of one attribute changes, then we can dete...

متن کامل

A novel technique to solve the supplier selection problem: combination of decision making trial and evaluation laboratory and graph theory and matrix approach methods

Considering the major change occurred in business cells from plant to “chain” and the critical need to choose the best partners to form the supply chain for competing in today’s business setting, one of the vital decisions made at the early steps of constructing a business is supplier selection. Given the fact that the early decisions are inherently strategic and therefore hard and costly to c...

متن کامل

Sensitivity Analysis in the QUALIFLEX and VIKOR Methods

The sensitivity analysis for multi-attribute decision making (MADM) problems is important for two reasons: First, the decision matrix as the source of the results of a decision problem is inaccurate because it sorts the alternatives in each criterion inaccurately. Second, the decision maker may change his opinions in a time period because of changes in the importance of the criteria and in the ...

متن کامل

On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2010